منابع مشابه
On Solving Flowshop Scheduling Problems
This paper proposes two variants of heuristic algorithms to solve the classic permutation flowshop scheduling problem. Both algorithms are simple and very efficient. The first algorithm is a constructive heuristic which builds the optimal schedule of jobs on the basis of a selective-greedy process. To escape the trap of local optimum points, for the second heuristic algorithm a stochastic featu...
متن کاملSolving knapsack problems on GPU
A parallel implementation via CUDA of the dynamic programming method for the knapsack problem on NVIDIA GPU is presented. A GTX 260 card with 192 cores (1.4 GHz) is used for computational tests and processing times obtained with the parallel code are compared to the sequential one on a CPU with an Intel Xeon 3.0 GHz. The results show a speedup factor of 26 for large size problems. Furthermore, ...
متن کاملOn Solving Combinatorial Optimization Problems
We present a new viewpoint on how some combinatorial optimization problems are solved. When applying this viewpoint to the NP -equivalent traveling salesman problem (TSP), we naturally arrive to a conjecture that is closely related to the polynomialtime insolvability of TSP, and hence to the P −NP conjecture. Our attempt to prove the conjecture has not been successful so far. However, the bypro...
متن کاملOn Solving Binate Covering Problems
Binate (or unate) covering problems occur at several steps during logic synthesis including two-level minimization and DAG covering. This paper presents a better lower bound computation algorithm and two new pruning techniques that significantly improve the efficiency of binate covering problem solvers. We show that these techniques reduce by up to three orders of magnitude the time required to...
متن کاملSolving Fractional Programming Problems based on Swarm Intelligence
This paper presents a new approach to solve Fractional Programming Problems (FPPs) based on two different Swarm Intelligence (SI) algorithms. The two algorithms are: Particle Swarm Optimization, and Firefly Algorithm. The two algorithms are tested using several FPP benchmark examples and two selected industrial applications. The test aims to prove the capability of the SI algorithms to s...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: SSRN Electronic Journal
سال: 2013
ISSN: 1556-5068
DOI: 10.2139/ssrn.2278948